The Constraint Satisfaction Problem: Complexity and Approximability
نویسندگان
چکیده
During the past two decades, an impressive array of diverse methods from several different mathematical fields, including algebra, logic, analysis, probability theory, graph theory, and combinatorics, have been used to analyze both the computational complexity and approximabilty of algorithmic tasks related to the constraint satisfaction problem (CSP), as well as the applicability/limitations of algorithmic techniques. The Dagstuhl Seminar 12451 “The Constraint Satisfaction Problem: Complexity and Approximability” was aimed at bringing together researchers using all the different techniques in the study of the CSP, so that they can share their insights. This report documents the material presented during the course of the seminar. Seminar 4.–9. November, 2012 – www.dagstuhl.de/12451 1998 ACM Subject Classification F.2.0 Analysis of Algorithms and Problem Complexity, General
منابع مشابه
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301)
From 25th to 30th October 2009, the Dagstuhl Seminar 09441 The Constraint Satisfaction Problem: Complexity and Approximability was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of sem...
متن کاملFixed-Parameter Approximability of Boolean MinCSPs
The minimum unsatisfiability version of a constraint satisfaction problem (MinCSP) asks for an assignment where the number of unsatisfied constraints is minimum possible, or equivalently, asks for a minimum-size set of constraints whose deletion makes the instance satisfiable. For a finite set Γ of constraints, we denote by MinCSP(Γ) the restriction of the problem where each constraint is from ...
متن کاملStructural Parameterizations of Language Restricted Constraint Satisfaction Problems
We study the fixed-parameter tractability of the constraint satisfaction problem. We restrict constraint relations to languages in a family of NP-hard languages, classified by a purely combinatorial criterion that generalizes Boolean matrices with fixed row and column sum. For various natural and established structural parameterizations of the instances, we characterize the fixed-parameter trac...
متن کاملOn the efficient approximability of constraint satisfaction problems
We discuss some results about the approximability of constraint satisfaction problems. In particular we focus on the question of when an efficient algorithm can perform significantly better than the algorithm that picks a solution uniformly at random.
متن کاملThe Approximability of Constraint Satisfaction Problems
We study optimization problems that may be expressed as “Boolean constraint satisfaction problems.” An instance of a Boolean constraint satisfaction problem is given by m constraints applied to n Boolean variables. Different computational problems arise from constraint satisfaction problems depending on the nature of the “underlying” constraints as well as on the goal of the optimization task. ...
متن کامل